New Galois Hulls of GRS Codes and Application to EAQECCs
نویسندگان
چکیده
Galois hulls of linear codes have important applications in quantum coding theory. In this paper, we construct some new classes (extended) generalized Reed-Solomon (GRS) with arbitrary dimensions. We also propose a general method on constructing GRS dimensions from special Euclidean orthogonal codes. Finally, several families entanglement-assisted error-correcting (EAQECCs) and MDS EAQECCs by utilizing the above results.
منابع مشابه
Right-projective Hulls and Galois Galois Theory
Let N be a bijective measure space. D. Sasaki’s classification of positive definite, globally universal domains was a milestone in homological Galois theory. We show that |O| ≤ K. The groundbreaking work of H. Thomas on contra-arithmetic planes was a major advance. Recent developments in analytic group theory [36, 36] have raised the question of whether Fréchet’s conjecture is false in the cont...
متن کاملconstruction and validation of translation metacognitive strategy questionnaire and its application to translation quality
like any other learning activity, translation is a problem solving activity which involves executing parallel cognitive processes. the ability to think about these higher processes, plan, organize, monitor and evaluate the most influential executive cognitive processes is what flavell (1975) called “metacognition” which encompasses raising awareness of mental processes as well as using effectiv...
Automorphism groups of GRS codes
We look at AG codes associated to P1, re-examining the problem of determining their automorphism groups (originally investigated by Dür in 1987 using combinatorial techniques) using recent methods from algebraic geometry. We classify those finite groups that can arise as the automorphism group of an AG code and give an explicit description of how these groups appear. We give examples of general...
متن کاملA CONSTRUcrION OF NON - GRS MDS CODES
We present a construction of long MDS codes which are not of the generalized Reed-Solomon (GRS) type. The construction employs subsets S, IS I = m, of a finite field F = GF(q) with the property that no t distinct elements of S add up to some fixed element of F . Large subsets of this kind are used to construct [n=m+2,k=t+l] non-GRS MDS codes over F. T ec hn io n C om pu te r Sc ie nc e D ep ar ...
متن کاملA Linear Algebraic Approach to Subfield Subcodes of GRS Codes
The problem of finding subfield subcodes of generalized Reed–Solomon (GRS) codes (i.e., alternant codes) is considered. A pure linear algebraic approach is taken in order to derive message constraints that generalize the well known conjugacy constraints for cyclic GRS codes and their Bose– Chaudhuri–Hocquenghem (BCH) subfield subcodes. It is shown that the presented technique can be used for fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cryptography and Communications
سال: 2021
ISSN: ['1936-2455', '1936-2447']
DOI: https://doi.org/10.1007/s12095-021-00525-8